TSTP Solution File: NUM821^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM821^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 10:48:16 EDT 2023
% Result : Timeout 299.98s 300.19s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM821^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.00/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n012.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri Aug 25 14:25:11 EDT 2023
% 0.22/0.37 % CPUTime :
% 0.22/0.52 %----Proving TH0
% 35.63/35.84 %------------------------------------------------------------------------------
% 35.63/35.84 % File : NUM821^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 35.63/35.84 % Domain : Number Theory (Induction on naturals)
% 35.63/35.84 % Problem : TPS problem from IND-THMS
% 35.63/35.84 % Version : Especial.
% 35.63/35.84 % English :
% 35.63/35.84
% 35.63/35.84 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 35.63/35.84 % Source : [Bro09]
% 35.63/35.84 % Names : tps_0914 [Bro09]
% 35.63/35.84
% 35.63/35.84 % Status : Unknown
% 35.63/35.84 % Rating : 1.00 v5.2.0
% 35.63/35.84 % Syntax : Number of formulae : 8 ( 1 unt; 6 typ; 1 def)
% 35.63/35.84 % Number of atoms : 13 ( 1 equ; 0 cnn)
% 35.63/35.84 % Maximal formula atoms : 11 ( 6 avg)
% 35.63/35.84 % Number of connectives : 33 ( 0 ~; 1 |; 6 &; 20 @)
% 35.63/35.84 % ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% 35.63/35.84 % Maximal formula depth : 12 ( 7 avg)
% 35.63/35.84 % Number of types : 2 ( 0 usr)
% 35.63/35.84 % Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% 35.63/35.84 % Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% 35.63/35.84 % Number of variables : 7 ( 0 ^; 7 !; 0 ?; 7 :)
% 35.63/35.84 % SPC : TH0_UNK_EQU_NAR
% 35.63/35.84
% 35.63/35.84 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 35.63/35.84 % project in the Department of Mathematical Sciences at Carnegie
% 35.63/35.84 % Mellon University. Distributed under the Creative Commons copyleft
% 35.63/35.84 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 35.63/35.84 % :
% 35.63/35.84 % Bugfixes : v5.2.0 - Added missing type declarations.
% 35.63/35.84 %------------------------------------------------------------------------------
% 35.63/35.84 thf(c0_type,type,
% 35.63/35.84 c0: $i ).
% 35.63/35.84
% 35.63/35.84 thf(cEVEN_type,type,
% 35.63/35.84 cEVEN: $i > $o ).
% 35.63/35.84
% 35.63/35.84 thf(cNUMBER_type,type,
% 35.63/35.84 cNUMBER: $i > $o ).
% 35.63/35.84
% 35.63/35.84 thf(cODD_type,type,
% 35.63/35.84 cODD: $i > $o ).
% 35.63/35.84
% 35.63/35.84 thf(cS_type,type,
% 35.63/35.84 cS: $i > $i ).
% 35.63/35.84
% 35.63/35.84 thf(cIND_type,type,
% 35.63/35.84 cIND: $o ).
% 35.63/35.84
% 35.63/35.84 thf(cIND_def,definition,
% 35.63/35.84 ( cIND
% 35.63/35.84 = ( ! [Xp: $i > $o] :
% 35.63/35.84 ( ( ( Xp @ c0 )
% 35.63/35.84 & ! [Xx: $i] :
% 35.63/35.84 ( ( Xp @ Xx )
% 35.63/35.84 => ( Xp @ ( cS @ Xx ) ) ) )
% 35.63/35.84 => ! [Xx: $i] : ( Xp @ Xx ) ) ) ) ).
% 35.63/35.84
% 35.63/35.84 thf(cTHM303A,conjecture,
% 35.63/35.84 ( ( cIND
% 35.63/35.84 & ( cEVEN @ c0 )
% 35.63/35.84 & ! [Xn: $i] :
% 35.63/35.84 ( ( cEVEN @ Xn )
% 35.63/35.84 => ( cEVEN @ ( cS @ ( cS @ Xn ) ) ) )
% 35.63/35.84 & ( cODD @ ( cS @ c0 ) )
% 35.63/35.84 & ! [Xn: $i] :
% 35.63/35.84 ( ( cODD @ Xn )
% 35.63/35.84 => ( cODD @ ( cS @ ( cS @ Xn ) ) ) )
% 35.63/35.84 & ! [Xn: $i] :
% 35.63/35.84 ( ( cNUMBER @ Xn )
% 35.63/35.84 <=> ( ( cEVEN @ Xn )
% 35.63/35.84 | ( cODD @ Xn ) ) ) )
% 35.63/35.84 => ! [Xn: $i] : ( cNUMBER @ Xn ) ) ).
% 35.63/35.84
% 35.63/35.84 %------------------------------------------------------------------------------
% 35.63/35.84 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.FccgYOZZPY/cvc5---1.0.5_27067.p...
% 35.63/35.84 (declare-sort $$unsorted 0)
% 35.63/35.84 (declare-fun tptp.c0 () $$unsorted)
% 35.63/35.84 (declare-fun tptp.cEVEN ($$unsorted) Bool)
% 35.63/35.84 (declare-fun tptp.cNUMBER ($$unsorted) Bool)
% 35.63/35.84 (declare-fun tptp.cODD ($$unsorted) Bool)
% 35.63/35.84 (declare-fun tptp.cS ($$unsorted) $$unsorted)
% 35.63/35.84 (declare-fun tptp.cIND () Bool)
% 35.63/35.84 (assert (= tptp.cIND (forall ((Xp (-> $$unsorted Bool))) (=> (and (@ Xp tptp.c0) (forall ((Xx $$unsorted)) (=> (@ Xp Xx) (@ Xp (@ tptp.cS Xx))))) (forall ((Xx $$unsorted)) (@ Xp Xx))))))
% 35.63/35.84 (assert (not (=> (and tptp.cIND (@ tptp.cEVEN tptp.c0) (forall ((Xn $$unsorted)) (=> (@ tptp.cEVEN Xn) (@ tptp.cEVEN (@ tptp.cS (@ tptp.cS Xn))))) (@ tptp.cODD (@ tptp.cS tptp.c0)) (forall ((Xn $$unsorted)) (=> (@ tptp.cODD Xn) (@ tptp.cODD (@ tptp.cS (@ tptp.cS Xn))))) (forall ((Xn $$unsorted)) (= (@ tptp.cNUMBER Xn) (or (@ tptp.cEVEN Xn) (@ tptp.cODD Xn))))) (forall ((Xn $$unsorted)) (@ tptp.cNUMBER Xn)))))
% 35.63/35.84 (set-info :filename cvc5---1.0.5_27067)
% 35.63/35.84 (check-sat-assuming ( true ))
% 35.63/35.84 ------- get file name : TPTP file name is NUM821^5
% 35.63/35.84 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_27067.smt2...
% 35.63/35.84 --- Run --ho-elim --full-saturate-quant at 10...
% 35.63/35.84 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 35.63/35.84 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 35.63/35.84 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 35.63/35.84 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 35.63/35.84 --- Run --no-ho-m/export/starexec/sandbox2/solver/bin/do_THM_THF: line 35: 27200 Alarm clock ( read result; case "$result" in
% 299.98/300.19 unsat)
% 299.98/300.19 echo "% SZS status $unsatResult for $tptpfilename"; echo "% SZS output start Proof for $tptpfilename"; cat; echo "% SZS output end Proof for $tptpfilename"; exit 0
% 299.98/300.19 ;;
% 299.98/300.19 sat)
% 299.98/300.19 echo "% SZS status $satResult for $tptpfilename"; cat; exit 0
% 299.98/300.19 ;;
% 299.98/300.19 esac; exit 1 )
% 299.98/300.19 Alarm clock
% 299.98/300.19 % cvc5---1.0.5 exiting
% 299.98/300.20 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------